#include<iostream>
#include<vector>
using namespace std;


int searchInsert(vector<int>& nums, int target) {
    int left = 0, right = nums.size() - 1;
    while (left < right) {
        int mid = left + (right - left) / 2;
        if (nums[mid] >= target) right = mid;
        else left = mid + 1;
    }
    if (target > nums[left]) return left + 1;
    return left;
}


int main()
{

    vector<int> nums = { 1,3,5,6 };
    searchInsert(nums, 7);
    return 0;
}